Extending Partial Representations of Interval Graphs
نویسندگان
چکیده
منابع مشابه
Extending Partial Representations of Circle Graphs
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some pre-drawn chords that represent an induced subgraph of G. The ques...
متن کاملExtending Partial Representations of Function Graphs and Permutation Graphs
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0, 1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time. Function graphs generalize permutation graphs, which arise when all functions considered are linear. We focus on the problem of extending partial representations...
متن کاملExtending Partial Representations of Subclasses of Chordal Graphs
Chordal graphs are intersection graphs of subtrees of a tree T . We investigate the complexity of the partial representation extension problem for chordal graphs. A partial representation specifies a tree T ′ and some pre-drawn subtrees of T . It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (i.e, keeps the pre-drawn ...
متن کاملExtending Partial Representations of Unit Circular-arc Graphs
The partial representation extension problem, introduced by Klav́ık et al. (2011), generalizes the recognition problem. In this short note we show that this problem is NP-complete for unit circular-arc graphs.
متن کاملMinimal Obstructions for Partial Representations of Interval Graphs
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. Two linear-time algorithms are known for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0186-z